NSF PAR Search | NSF Public Access Repository

Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

Selling information in competitive environments

https://doi.org/10.1016/j.jet.2023.105779

Bonatti, Alessandro; Dahleh, Munther; Horel, Thibaut; Nouripour, Amir (March 2024, Journal of Economic Theory)

Full Text Available
Data structures meet cryptography: 3SUM with preprocessing

https://doi.org/10.1145/3357713.3384342

Golovnev, Alexander; Guo, Siyao; Horel, Thibaut; Park, Sunoo; Vaikunathan, Vinod. (January 2020, Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing)
null (Ed.)
Full Text Available
Unifying Computational Entropies via Kullback–Leibler Divergence

https://doi.org/10.1007/978-3-030-26951-7_28

Agrawal, Rohit; Chen, Yi-Hsiu; Horel, Thibaut; Vadhan, Salil (January 2019, CRYPTO 2019, Lecture Notes in Computer Science)

We introduce KL-hardness, a new notion of hardness for search problems which on the one hand is satisfied by all one-way functions and on the other hand implies both next-block pseudoentropy and inaccessible-entropy, two forms of computational entropy used in recent constructions of pseudorandom generators and statistically hiding commitment schemes, respectively. Thus, KL-hardness unifies the latter two notions of computational entropy and sheds light on the apparent "duality" between them. Additionally, it yields a more modular and illuminating proof that one-way functions imply next-block inaccessible entropy, similar in structure to the proof that one-way functions imply next-block pseudoentropy (Vadhan and Zheng, STOC '12).
more » « less
Full Text Available

Search for: All records